Error Exponents in the Bee Identification Problem

Error Exponents in a Source Coding Problem of Korner

Consider a discrete memoryless stationary information source with nite alphabet Suppose that the letters emitted by the source are not all distinguishable This might be the case for example if the symbols were handwritten letters Distinguishability be tween letters is a symmetric relation and thus determines a graph on the source alphabet Similarly one talks of distinguishability between xed le...

Multiple Objects: Error Exponents in Hypotheses Testing and Identification

“One can conceive of Information Theory in the broad sence as covering the theory of Gaining, Transferring, and Storing Information, where the first is usually called Statistics.”[2]. Shannon information theory and mathematical statistics interaction revealed to be effective. This interplay is mutually fruitful, in some works results of probability theory and statistics were obtained with appli...

Error Exponents of Expander Codes

We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between zero and channel capacity. The decoding complexity grows linearly with code length.

Error exponents for entanglement concentration

Consider entanglement concentration schemes that convert n identical copies of a pure state into a maximally entangled state of a desired size with success probability being close to one in the asymptotic limit. We give the distillable entanglement, the number of Bell pairs distilled per copy, as a function of an error exponent, which represents the rate of decrease in failure probability as n ...

Error exponents of expander codes